搜索资源列表
CS编的Dijkstra算法(图形界面)
- Windows应用程序,C#编写,实现了求最短路径的Dijkstra算法,方便操作,可以自已在程序界面上指定每一个点的位置,在界面上空白的地方每点击一下生成一个点(该点是一个可以点击的按钮),这些按钮按照出现的先后顺序自动从1开始编号(目前程序设定最多支持100个点,可自行更改)。界面右上角是计算结果显示区,往下是权值输入区和“连线”、“清屏”“计算”三个按钮以及状态区,状态区显示当前的起点和终点,连线和计算都要用到该信息(点击生成的顺序编号的那些按钮可以依次改变起点和终点)。输入权值后点“连线
网络最短路径Dijkstra算法A
- 网络最短路径Dijkstra算法-network Dijkstra shortest path algorithm
dijkstra
- Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,-Dijkstra' s algorithm is a typical shortest path algorithm used to calculate a node to all other nodes of the shortest path. Main features is the starting
dijkstra
- Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,但由于它遍历计算的节点很多,所以效率低。 -Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. Main feature
DijkstraRouting
- 用于MATLAB 6.0 (R12)环境 Dijkstra最短路由算法源代码- MATLAB 6.0 (R12) Dijkstra Shortest Path Routing
zuiduanlujing
- 优化了之前的那个版本,最短路径用Dijkstra算法实现的MFC编程,这次是按实际的路径来将路画出来了。-That before the optimized version of Dijkstra shortest path algorithm using the MFC programming, this is the actual path to the road drawn out.
Dijkstra
- 迪杰斯特拉最短路径算法,有兴趣的可以在此基础上进一步优化-Optimized Dijkstra shortest path algorithm
wsn-dijkstra
- 这个程序为能量均衡的无线传感器的最短路径路由算法matlab 编程。-This process is energy balanced shortest path routing in wireless sensor algorithm matlab programming.
SHORTPATHmatlab
- Dijkstra算法与Floyd算法的matlab实现,以求解最短路问题-Dijkstra algorithm and Floyd algorithm matlab realize in order to solve the shortest path problem
tree
- 用树的应用模拟铁路查询功能。掌握图的邻接表的定义及应用,能够熟练使用邻接表。加强对map容器的理解,能够熟练使用map容器,复习集合和字典的相关知识。理解最短路径问题,并使用Dijkstra算法解决最短路径问题。掌握线形表的使用,并理解优先队列解决问题的过程。利用栈解决需要逆向输出的问题。 -Application of simulation using the tree railway inquiry function. Master graph adjacency list of def
Dijkstra
- Dijkstra最短路径算法 Dijkstra最短路径算法-Dijkstra shortest path algorithm Dijkstra shortest path algorithm
Dijkstra
- Dijkstra算法源码,图论中求解最短路径-Dijkstra algorithm source, graph theory for solving the shortest path
Dijkstra
- 使用DIJKSTAR算法解决多点最短路径,还带文字解说-Dijkstar algorithm used to solve multi-point shortest path, but also with text to explain
Dijkstra
- Dijkstra算法,实现加权有向图中从确定的起点寻找最短路径并输出-Dijkstra algorithm, to achieve a weighted directed graph from the starting point to determine the shortest path to find and output
migongsuanfa
- 将从迷宫入口到各点的最短路近的集合看作一棵树。用广度遍历 的方法即可找到出口的最短路近。本程序算法思想来源于求图上一点 到其余各点最短路近的Dijkstra算法。-Maze from the entrance point to the most recent collection of short circuit as a tree. Breadth traversal methods used to find the shortest path near exports. Algo
Dijkstra
- 最短路的Dijkstra算法,程序用c#语言实现-The Dijkstra shortest path algorithm, the procedure with c# language implementation
Dijkstra
- 用java实现的Dijkstra算法,当用户输入起始点和终点时,会自动产生两点之间的最短路径-Using java implementation of the Dijkstra algorithm, when the user enters the starting point and end point, it will automatically generate the shortest path between two points
guangdusousuo
- 宽度优先搜索算法(又称广度优先搜索)是最简便的图的搜索算法之一,这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想-Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, this algorithm is also a lot of
Dijkstra-Matlab
- Dijkstra最短路算法Matlab程序用于求从起始点s到其它各点的最短路-Dijkstra shortest path algorithm from the Matlab program used to find the starting point s to other points of the shortest
Dijkstra最短路算法
- Dijkstra最短路算法Matlab实现(Dijkstra shortest path algorithm Matlab implementation)